A branch and cut algorithm for hub location problems with single assignment
نویسندگان
چکیده
منابع مشابه
A branch and cut algorithm for hub location problems with single assignment
The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and...
متن کاملBranch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
This paper presents a branch–and–price algorithm for the Capacitated Hub Location Problem with Single Assignment, in which Lagrangean relaxation is used to obtain tight lower bounds of the Restricted Master Problem (RPM). It is shown how to solve the pricing problem for finding new columns to be added to the RMP, or for proving that the lower bound of the current RMP is valid. Also, a lower bou...
متن کاملA branch-and-cut algorithm for the hub location and routing problem
We study the hub location and routing problem where we jointly decide on the location of hubs, the allocation of nodes to hubs, and the routing among the nodes allocated to the same hubs, with the aim of minimizing the total transportation cost. Each hub has one vehicle that visits all the nodes assigned to it on a cycle. We propose a mixed integer programming formulation for this problem and s...
متن کاملA branch-and-cut algorithm for the partitioning-hub location-routing problem
We introduce the Partitioning-Hub-Location-Routing Problem (PHLRP), a hub location problem involving graph partitioning and routing features. The PHLRP consists of partitioning a given network into sub-networks, locating at least one hub in each sub-network and routing the traffic within the network at minimum cost. This problem finds applications in deployment of an Internet Routing Protocol c...
متن کاملA Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem
In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2004
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-004-0531-x